#define _CRT_SECURE_NO_WARNINGS 1

#include"BinarySearchTree.h"

int main()
{
    int a[] = {8, 9, 3, 12, 2, 4, 7, 16, 18};
    BSTree<int> bt;
    for (auto e : a)
    {
        bt.insert(e);
    }
    bt.InOrder();
    bt.erase(4);
    bt.InOrder();
    return 0;
}